The bifurcation set of a rational function via Newton polytopes

نویسندگان

چکیده

The bifurcation sets of polynomial functions have been studied by many mathematicians from various points view. In particular, Némethi and Zaharia described them in terms Newton polytopes. this paper, we will show analogous results for rational functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Parametrizations, Intersection Theory and Newton Polytopes

The study of the Newton polytope of a parametric hypersurface is currently receiving a lot of attention both because of its computational interest and its connections with Tropical Geometry, Singularity Theory, Intersection Theory and Combinatorics. We introduce the problem and survey the recent progress on it, with emphasis in the case of curves.

متن کامل

Absolute Irreducibility of Polynomials via Newton Polytopes

A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple irreducibility criteria including the well-known Eisenstein’s criterion. Polynomials from these ...

متن کامل

IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.

متن کامل

Newton Polytopes and Witness Sets

We present two algorithms that compute the Newton polytope of a polynomial f defining a hypersurface H in Cn using numerical computation. The first algorithm assumes that we may only compute values of f—this may occur if f is given as a straightline program, as a determinant, or as an oracle. The second algorithm assumes that H is represented numerically via a witness set. That is, it computes ...

متن کامل

Simple Non-Rational Convex Polytopes via Symplectic Geometry

In this article we consider a generalization of manifolds and orbifolds which we call quasifolds; quasifolds of dimension k are locally isomorphic to the quotient of the space R k by the action of a discrete group typically they are not Hausdorff topological spaces. The analogue of a torus in this geometry is a quasitorus. We define Hamiltonian actions of quasitori on symplectic quasifolds and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Zeitschrift

سال: 2021

ISSN: ['1432-1823', '0025-5874']

DOI: https://doi.org/10.1007/s00209-021-02698-7